split graph 예문

예문

예문 더보기:   1  2  3  4

1. Because chordal graphs are perfect, so are the split graphs.
2. Split graphs have cochromatic number 2.
3. Finding a Hamiltonian cycle remains NP-complete even for split graphs which are strongly chordal graphs.
4. It is also well known that the Minimum Dominating Set problem remains NP-complete for split graphs.
5. The double split graphs are a relative of the split graphs that can also be shown to be perfect.